A Quantum Observable for the Graph Isomorphism Problem
نویسندگان
چکیده
Suppose we are given two graphs on n vertices. We define an observable in the Hilbert space C[(Sn ≀ S2)m] which returns the answer “yes” with certainty if the graphs are isomorphic and “no” with probability at least 1 − n! 2 if the graphs are not isomorphic. We do not know if this observable is efficiently implementable.
منابع مشابه
Quantum Algorithms and Lower Bounds for Independent Set and Subgraph Isomorphism Problem
The study of the quantum query complexity for some graph problems is an interesting area in quantum computing. Only for a few graph problems there are quantum algorithms and lower bounds known. We present some new quantum query and quantum time algorithms and quantum query complexity bounds for the maximal and maximum independent set problem and the graph and subgraph isomorphism problem.
متن کاملQuantum Algorithms for Tree Isomorphism and State Symmetrization
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An interesting open problem is whether quantum computers can solve the graph isomorphism problem in polynomial time. In this paper, an algorithm is shown which c...
متن کاملQuantum approaches to the graph isomorphism problem vorgelegt
The graph isomorphism problem consists in deciding whether two graphs are actually the same even if they look different in their graphical or adjacency matrix representation. The problem has important applications, especially in computer science and chemistry. Moreover, the problem has remarkable properties in terms of its complexity. Most notably, it is not known to be in P, but also not known...
متن کاملPhysically-motivated dynamical algorithms for the graph isomorphism problem
Submitted for the MAR05 Meeting of The American Physical Society Physically-motivated dynamical algorithms for the graph isomorphism problem SHIUEYUAN SHIAU, ROBERT JOYNT, S.N. COPPERSMITH, Physics Dept., Univ. of Wisconsin-Madison — The graph isomorphism problem (GI) plays a central role in the theory of computational complexity and has importance in physics and chemistry as well. No polynomia...
متن کاملQuantum Measurements for Graph Isomorphism Require Entanglement: Tight Results on Multiregister Fourier Sampling
Recently, Moore, Russell and Schulman showed that quantum measurements of single coset states in the symmetric group yield exponentially little information about the Hidden Subgroup Problem in the case relevant to Graph Isomorphism. Extending their techniques to multiregister Fourier sampling, Moore and Russell showed that entangled measurements over pairs of registers yield superpolynomially l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999